Real-time Estimation on Service Completion Time of Logistics Process for Container Vessels
نویسندگان
چکیده
منابع مشابه
Fuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملFuzzy Real-Time Optimization of the Tennessee Eastman Challenge Process
A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is the...
متن کاملReal Time Calibration of Strap-down Three-Axis-Magnetometer for Attitude Estimation
Three-axis-magnetometers (TAMs) are widely utilized as a key component of attitude determination subsystems and as such are considered the corner stone of navigation for low Earth orbiting (LEO) space systems. Precise geomagnetic-based navigation demands accurate calibration of the magnetometers. In this regard, a complete online calibration process of TAM is developed in the current research t...
متن کاملEvaluating project’s completion time with Q-learning
Nowadays project management is a key component in introductory operations management. The educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. In this paper, we evaluated project’s completion time utilizing the Q-learning algorithm. So the ...
متن کاملA New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Society for e-Business Studies
سال: 2012
ISSN: 1226-3931
DOI: 10.7838/jsebs.2012.17.2.149